NCRA: An Opportunistic Networks Routing Algorithm based on Network Coding

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Network Coding Based Multipath Opportunistic Routing Algorithm for Satellite Networks

Satellite networks could offer global communication without need of terrestrial infrastructure. Network coding could exploit the shared nature of wireless medium to improve network throughput. In this paper, we combine the satellite network routing algorithm with network coding, proposing a novel Network Coding based Multipath Opportunistic Routing Algorithm (NC-MORA) for Satellite Networks. Th...

متن کامل

Routing for Opportunistic Networks Based on Probabilistic Erasure Coding

We investigate the problem of routing in opportunistic networks and propose a novel routing algorithm, which combines probabilistic routing with erasure coding. Erasure coding generates large amounts of code blocks with fixed overhead; we apply a sophisticated but realistic method to allocate the generated code blocks to nodes that relies on a probabilistic metric for evaluating node potential....

متن کامل

Network Coding Combined With Rate Diversity Gains in MANET Based On an Opportunistic Routing Scheme

This paper investigates the performance gains obtained by combining network coding and rate diversity gains in wireless environment. Network coding is a new research area which has a lot of interesting applications in practical networking systems. Link rate diversity provides another degree of freedom in wireless environment. Using network coding, intermediate nodes broadcast packets that are l...

متن کامل

Efficient Clustering Routing Algorithm Based on Opportunistic Routing

Based on the analysis of the existing classic clustering routing algorithm HEED, this paper proposes an efficient dynamic clustering routing algorithm ED-HEED. In the cluster selection process, in order to optimize the network topology and select more proper nodes as the cluster head, the proposed clustering algorithm considers the shortest path prediction of the node to the destination sink an...

متن کامل

Opportunistic Routing in Delay Tolerant Network with Different Routing Algorithm

Present new mechanisms for modelling multiple interfaces on a node, support for interference-limited links and a framework for modelling complex applications running on the nodes. Furthermore, provide an overview of concrete use cases where the simulator has been successfully exploited to study a variety of aspects related to opportunistic, message-based communications. Node movement is impleme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Future Generation Communication and Networking

سال: 2015

ISSN: 2233-7857

DOI: 10.14257/ijfgcn.2015.8.3.13